Theoretical foundations for illocutionary structure parsing
نویسندگان
چکیده
Illocutionary structure in real language use is intricate and complex, and nowhere more so than in argument and debate. Identifying this structure without any theoretical scaffolding is extremely challenging even for humans. New work in Inference Anchoring Theory has provided significant advances in such scaffolding which are helping to allow the analytical challenges of argumentation structure to be tackled. This paper demonstrates how these advances can also pave the way to automated and semi-automated research in understanding the structure of natural debate.
منابع مشابه
A Data-Oriented Parsing Model for HPSG
Data Oriented Parsing (DOP) is based on the idea of processing new input by combining fragments (associated with some probabilities) that are extracted from a treebank. In the simplest case these fragments are subparts of simple phrase structure trees (Tree-DOP). The approach is attractive in many ways but the impoverished representational basis is a serious drawback from a linguistic point of ...
متن کاملTowards Argument Mining from Dialogue
Argument mining has started to yield early results in automatic analysis of text to produce representations of reason-conclusion structures. This paper addresses for the first time the question of automatically extracting such structures from dialogical settings of argument. More specifically, we introduce theoretical foundations for dialogical argument mining as well as show the initial implem...
متن کاملAn improved joint model: POS tagging and dependency parsing
Dependency parsing is a way of syntactic parsing and a natural language that automatically analyzes the dependency structure of sentences, and the input for each sentence creates a dependency graph. Part-Of-Speech (POS) tagging is a prerequisite for dependency parsing. Generally, dependency parsers do the POS tagging task along with dependency parsing in a pipeline mode. Unfortunately, in pipel...
متن کامل15–212: Fundamental Structures of Computer Science II Some Notes on Grammars and Parsing
These notes are intended as a “rough and ready” guide to grammars and parsing. The theoretical foundations required for a thorough treatment of the subject are developed in the Formal Languages, Automata, and Computability course. The construction of parsers for programming languages using more advanced techniques than are discussed here is considered in detail in the Compiler Construction course.
متن کاملCategorical Type Analysis for Parsing Algebras
Solving the problems by computers we always start with formulation of their theoretical foundations. We use necessary mathematical theories and reason in them to obtain expected results. In this contribution we assume a theoretical description of programming process as logical reasoning over axiomatized theories. We consider intuitionistic logical reasoning over type theory of solved problem. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Argument & Computation
دوره 7 شماره
صفحات -
تاریخ انتشار 2016